An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
Authors
Abstract:
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is developed. We show how to transform the dynamic programming algorithm to an FPTAS using the technique of "structuring the execution of an algorithm" and examine the time complexity of our FPTAS.
similar resources
An Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neig...
full textAn Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. 
 Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for ne...
full textSingle Machine Scheduling for Jobs with Individual Due Dates and a Learning effect: Genetic Algorithm Approach
In this paper, we present a genetic algorithm approach that considers the single machine scheduling problem. There are n jobs, in which each job j ( 1 2 j n = , ,..., ) has a normal processing time j p , a due date j d , earliness penalty j α , and tardiness penalty j β . The objective is to find the sequence of jobs that minimizes the weighted sum of earliness and tardiness penalty costs, with...
full textSingle Machine Scheduling with Distinct Due Dates under Fuzzy Environment
Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...
full textApproximation Algorithms for Minimizing Sum of Flow Time on a Single Machine with Release Dates
This paper considers the scheduling problem of minimizing the sum of flowtime on single machine with release dates. It is well known that the problem is NP-Hard, therefore in order to solve the problem, two approximation algorithms (KSA1 and KSA2) were proposed. KSA1 and KSA2 algorithms were compared with the MPSW (selected from the literature) and the Branch and Bound (BB) method. All the four...
full textSingle-machine scheduling with waiting-time-dependent due dates
We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...
full textMy Resources
Journal title
volume 9 issue 2
pages 1- 19
publication date 2016-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023